Solving Consensus in a Byzantine Environment Using an Unreliable Fault Detector
نویسندگان
چکیده
Unreliable fault detectors can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous distributed systems that are subject to Byzantine faults. We define the class 3S(Byz) of eventually strong Byzantine fault detectors and the class 3W(Byz) of eventually weak Byzantine fault detectors and show that any Byzantine fault detector in 3W(Byz) can be transformed into a Byzantine fault detector in 3S(Byz). We present an algorithm that uses a fault detector in 3S(Byz) to solve the consensus problem in an asynchronous distributed system with at most b(n 1)=3c Byzantine faults. The class 3W(Byz) of Byzantine fault detectors is the weakest class of fault detectors that can be used to solve consensus in such an asynchronous distributed system.
منابع مشابه
Byzantine Fault Detectors for Solving Consensus
Unreliable fault detectors can be defined in terms of completeness and accuracy properties and can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous distributed systems that are subject to Byzantine faults. First, we define and categorize Byzantine faults. We then define two new completeness propert...
متن کاملConsensus in byzantine asynchronous systems
This paper presents a consensus protocol resilient to Byzantine failures. It uses signed and certified messages and is based on two underlying failure detection modules. The first is an unreliable failure detector module of the class 3S(bz). The second is a reliable arbitrary behavior detection module. More precisely, the first module detects processes that stop sending messages, while processe...
متن کاملMute Failure Detectors for Consensus with Byzantine Processes
Failure detectors have been proposed by Chandra and Toueg for solving the Consensus problem in an asynchronous system with process crash failures. The paper extends failure detectors to the case of Byzantine failures, by deening the failure detector 3M based on the notion of M ute process. The failure detector 3M is deened by the Mute Completeness and the Weak Accuracy properties. The paper als...
متن کاملAusfalldetektoren und das Consensus-Problem im Crash-Recovery-Modell
4 INHALTSVERZEICHNIS 4. Abstract (English Version) The Consensus problem is a fundamental paradigm for fault tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to Consensus can serve as a basic building block for solving such problems (e.g. Atomic Commitment or Atomic Broadcast). Solving Consensus in an asynchronous syste...
متن کاملUnreliable Intrusion Detection in Distributed Computations
Distributed coordination is diicult, especially when the system may suuer intrusions that corrupt some component processes. In this paper we introduce the abstraction of a failure detector that a process can use to (imperfectly) detect the corruption (Byzantine failure) of another process. In general, our failure detectors can be unreliable, both by reporting a correct process to be faulty or b...
متن کامل